Why Arrow’s theorem matters for political theory even if preference cycles never occur
نویسندگان
چکیده
منابع مشابه
Margaret McCartney: Nuclear weapons do harm, even if never used.
By Loch Long, a couple of hours’ cycle ride from Glasgow, the wind was biting, the sun was shining, and the nuclear weapons were just across the water. I went to my first protest at Faslane when I was a medical student in the late 1980s. The Campaign for Nuclear Disarmament was a visible protest group then, rather than a symbol seen on T shirts sold to fashionable people with no allegiance to t...
متن کاملA theory of political cycles
We study how the proximity of elections affects policy choices in a model in which policymakers want to improve their reputation to increase their reelection chances. Policymakers’ equilibrium decisions depend on both their reputation and the proximity of the next election. Typically, incentives to influence election results are stronger closer to the election (for a given reputation level), as...
متن کاملA theory of political and economic cycles
We develop a theoretical framework in which political and economic cycles are jointly determined. These cycles are driven by three political economy frictions: policymakers are non-benevolent, they cannot commit to policies, and they have private information about the tightness of the government budget and rents. Our first main result is that, in the best sustainable equilibrium, distortions to...
متن کاملDice games and Arrows theorem
We observe that non-transitivity is not the most general way that Arrows impossibility theorem is reected in dice games. Non-transitivity in dice games is a well-known phenomenon. It was described in several Scienti c American columns in the 1970s, beginning with [3], and has since become a popular topic, discussed in articles like [4, 5] and textbooks on elementary mathematics and probabilit...
متن کاملFinding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Public Choice
سال: 2018
ISSN: 0048-5829,1573-7101
DOI: 10.1007/s11127-018-0521-9